Finite-state strategies in delay games

Finite-state Strategies in Delay Games

What is a finite-state strategy in a delay game? We answer this surprisingly non-trivial question and present a very general framework for computing such strategies: they exist for all winning conditions that are recognized by automata with acceptance conditions that satisfy a certain aggregation property. Our framework also yields upper bounds on the complexity of determining the winner of suc...

Finite-State Strategies in Regular Infinite Games

Abs t rac t . This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller automata and by game graphs (as introduced by McNaughton) is considered, and the construction of winning strategies is described in three stages, covering "guarantee games", "recurrence games", and generM regular ...

Finite State Strategies in One Player McNaughton Games

Finite State Equilibria in Dynamic Games

An equilibrium in an infinite horizon game is called a finite state equilibrium, if each player’s action on the equilibrium path is given by an automaton with a finite state space. We provide a complete characterization of this class of equilibria and provide a recursive computational method to check the equilibrium conditions. This encompasses the majority of existing works on repeated games w...

Persistently Good Strategies for Nonleavable Stochastic Games With Finite State Space

The notion of persistently optimal strategy in gambling theory is analogous to that of subgameperfect equilibria in game theory. We prove the existence of persistently -optimal strategies for the players engaged in a nonleavable stochastic game with finite state space.